Cottbus Timed Automata: Formal Definition and Compositional Semantics
نویسنده
چکیده
We present a formalism for modular modeling of hybrid systems, the Cottbus Timed Automata. For the theoretical basis, we build on work about timed and hybrid automata. We use concepts from concurrency theory to model communication of separately defined modules, and we extend these concepts to be able to express explicitly readand write-access to signals and variables.
منابع مشابه
Cottbus Timed Automata: Formal Definition and Semantics
We present a formalism for modular modelling of hybrid systems, the Cottbus Timed Automata. For the theoretical basis, we build on work about timed and hybrid automata. We use concepts from concurrency theory to model communication of separately defined modules, but we extend these concepts to be able to express explicitly readand write-access to signals and variables.
متن کاملEfficient Reachability Analysis and Refinement Checking of Timed Automata Using BDDs
For the formal specification and verification of real-time systems we use the modular formalism Cottbus Timed Automata (CTA), which is an extension of timed automata [AD94]. Matrix-based algorithms for the reachability analysis of timed automata are implemented in tools like Kronos, Uppaal, HyTech and Rabbit. A new BDD-based version of Rabbit, which supports also refinement checking, is now ava...
متن کاملSyntax and semantics of the compositional interchange format for hybrid systems
Different modeling formalisms for timed and hybrid systems exist, each of whichaddresses a specific set of problems, and has its own set of features. These for-malisms and tools can be used in each stage of the embedded systems development,to verify and validate various requirements.The Compositional Interchange Format (CIF), is a formalism based on hybridautomata, which...
متن کاملRabbit: Verification of Real-Time Systems
This paper gives a short overview of a model checking tool for Cottbus Timed Automata, which is a modular modeling language based on timed and hybrid automata. For timed automata, the current version of the tool provides BDD-based verification using an integer semantics. Reachability analysis as well as refinement checking is possible. To find good variable orderings it uses the component struc...
متن کاملRobust Analysis of Timed Automata via Channel Machines
Whereas formal verification of timed systems has become a very active field of research, the idealised mathematical semantics of timed automata cannot be faithfully implemented. Several works have thus focused on a modified semantics of timed automata which ensures implementability, and robust model-checking algorithms for safety, and later LTL properties have been designed. Recently, a new app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001